منابع مشابه
iARIS - Supporting Enterprise Transformation Using An Iterative ISD Method
Enterprise architecture frameworks can be used to guide the development process of an information system (IS). While these frameworks cover a comprehensive approach to IS development, most of them essentially proclaim a linear, stepwise development process. In the field of computer science, such linear, waterfall-based approaches have been replaced by so-called agile methods proclaiming an iter...
متن کاملThe spectral iterative method for Solving Fractional-Order Logistic Equation
In this paper, a new spectral-iterative method is employed to give approximate solutions of fractional logistic differential equation. This approach is based on combination of two different methods, i.e. the iterative method cite{35} and the spectral method. The method reduces the differential equation to systems of linear algebraic equations and then the resulting systems are solved by a numer...
متن کاملApplication of differential transformation method to the fisher equation.
In this paper, the dierential transform method (DTM) is applied to the Fisherequation. This method can be used to obtain the exact solutions of Fisherequation. Finally, we give some examples to illustrate the suciency of themethod for solving such nonlinear partial dierential equations. These resultsshow that this technique is easy to apply.
متن کاملA Simple Transformation Method in Skewness Reduction
Statistical analysis of non-normal data is usually more complicated than that for normaldistribution. In this paper, a simple root/power transformation technique developed by Niaki, et al [1]is extended to transform right and left skewed distributions to nearly normal. The value of theroot/power is explored such that the skewness of the transformed data becomes almost zero with anacceptable err...
متن کاملAn Iterative Method for
It is of interest in various contexts to nd approximate feasible points to problems that have equality, inequality and bound constraints. For example, in exhaustive search algorithms for global optimization , it is of interest to construct bounds around approximate feasible points, within which a true feasible point is proven to exist. In such exhaustive search algorithms, the approximate feasi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Non-Linear Mechanics
سال: 2019
ISSN: 0020-7462
DOI: 10.1016/j.ijnonlinmec.2019.06.011